On the Role of Disjunctive Representations and Constraint Propagation in Refinement Planning
نویسندگان
چکیده
Most existing planners intertwine the refinement of a partial plan with search by pushing the individual refinements of a plan into different search branches. Although this approach reduces the cost of handling partial plans, it also often leads to search space explosion. In this paper, we consider the possibility of handling the refinements of a partial plan together (without splitting them into search space). This is facilitated by disjunctive partial plan representations that can compactly represent large sets of partial plans. Disjunctive representations have hitherto been shunned since they may increase the plan handling costs. We argue that performance improvements can be obtained despite these costs by the use of (a) constraint propagation techniques to simplify the disjunctive plans and (b) CSP/SAT techniques to extract solutions from them. We will support this view by showing that some recent promising refinement planners, such as the GRAPHPLAN algorithm [2], can be seen as deriving their power from disjunctive plan representations. We will also present a new planning algorithm, UCPOPD, which uses disjunctive representations over UCPOP [19] to improve performance. Finally, we will discuss the issues and tradeoffs involved in planning with disjunctive representations.
منابع مشابه
MDD Propagation for Disjunctive Scheduling
Disjunctive scheduling is the problem of scheduling activities that must not overlap in time. Constraint-based techniques, such as edge finding and not-first/not-last rules, have been a key element in successfully tackling large and complex disjunctive scheduling problems in recent years. In this work we investigate new propagation methods based on limited-width Multivalued Decision Diagrams (M...
متن کاملMaking Graphplan Goal-Directed
The Graphplan algorithm exemplifies the speed-up achieveable with disjunctive representations that leverage opposing directions of refinement. It is in this spirit that we introduce Bsrgraphplan, a work in progress intended to address issues of scalability and expressiveness which are problematic for Graphplan. Specifically, we want to endow the planner with intelligent backtracking and full qu...
متن کاملUnderstanding and Extending Graphplan
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstruction, the process of growing the planning-graph and inferring mutex relations corresponds to doing forward state-space refinement over disjunctively represented plans. The backward search phase of Graphplan corresponds to ...
متن کاملUsing Disjunctive orderings instead of Conflict Resolution in Partial order planning
Resolving conflicts in partial order planning by means of promotion and demotion has been an standard idea in least commitment planning for over twenty years. Recent analyses of partial order planning show that promotion/demotion refinements are optional from the point of view of completeness. Furthermore, promotion/demotion refinements run counter to the idea of least-commitment since the plan...
متن کاملEfficient Propagation of Disjunctive Constraints using Watched Literals
Efficient constraint propagation is important for all constraint solvers. One of the key reasons that Boolean Satisfiability solvers are often more efficient than constraint solvers is that they can propagate disjunctive constraints efficiently. This propagation is undertaken using the watched literals mechanism. In a recent paper Gent et al. showed how watched literals can be used in constrain...
متن کامل